0.10/0.11 % Problem : theBenchmark.p : TPTP v0.0.0. Released v0.0.0. 0.10/0.12 % Command : eprover-ho %s --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --free-numbers -auto-schedule -p --cpu-limit=%d --neg-ext=all --pos-ext=all --ext-sup-max-depth=2 --schedule-kind=CASC 0.12/0.32 % Computer : n013.cluster.edu 0.12/0.32 % Model : x86_64 x86_64 0.12/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz 0.12/0.32 % Memory : 8042.1875MB 0.12/0.32 % OS : Linux 3.10.0-693.el7.x86_64 0.12/0.32 % CPULimit : 1200 0.12/0.32 % WCLimit : 120 0.12/0.32 % DateTime : Tue Jul 13 10:09:33 EDT 2021 0.12/0.32 % CPUTime : 0.12/0.32 % Number of cores: 8 0.12/0.32 % Python version: Python 3.6.8 0.12/0.32 # Version: 2.6rc1-ho 0.12/0.32 # No SInE strategy applied 0.12/0.32 # Trying AutoSched0 for 59 seconds 0.17/0.36 # AutoSched0-Mode selected heuristic G_____0013_C18_F1_SE_CS_SP_S0Y 0.17/0.36 # and selection function SelectMaxLComplexAvoidPosPred. 0.17/0.36 # 0.17/0.36 # Preprocessing time : 0.028 s 0.17/0.36 0.17/0.36 # Proof found! 0.17/0.36 # SZS status Theorem 0.17/0.36 # SZS output start CNFRefutation 0.17/0.36 thf(cEQP1_1B_pme, conjecture, ![X1:a > $o, X2:a > $o]:(?[X3:a > a]:(![X4:a]:(?[X5:a]:((X2 @ X5&(X4)=(X3 @ X5))&![X6:a]:((X6)=(X5)<=(X2 @ X6&(X4)=(X3 @ X6))))<=X1 @ X4)&![X5:a]:(X1 @ (X3 @ X5)<=X2 @ X5))<=?[X3:a > a]:(![X4:a]:(?[X5:a]:(((X4)=(X3 @ X5)&![X6:a]:(((X4)=(X3 @ X6)&X1 @ X6)=>(X6)=(X5)))&X1 @ X5)<=X2 @ X4)&![X5:a]:(X2 @ (X3 @ X5)<=X1 @ X5))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', cEQP1_1B_pme)). 0.17/0.36 thf(c_0_1, negated_conjecture, ~(![X1:a > $o, X2:a > $o]:(?[X3:a > a]:(![X4:a]:(X2 @ X4=>?[X5:a]:(((X4)=(X3 @ X5)&![X6:a]:(((X4)=(X3 @ X6)&X1 @ X6)=>(X6)=(X5)))&X1 @ X5))&![X5:a]:(X1 @ X5=>X2 @ (X3 @ X5)))=>?[X3:a > a]:(![X4:a]:(X1 @ X4=>?[X5:a]:((X2 @ X5&(X4)=(X3 @ X5))&![X6:a]:((X2 @ X6&(X4)=(X3 @ X6))=>(X6)=(X5))))&![X5:a]:(X2 @ X5=>X1 @ (X3 @ X5))))), inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[cEQP1_1B_pme])])). 0.17/0.36 thf(c_0_2, negated_conjecture, ![X22:a, X24:a, X25:a, X26:a > a, X28:a]:((((((X22)=(esk1_0 @ (esk2_1 @ X22))|~epred2_0 @ X22)&((X22)!=(esk1_0 @ X24)|~epred1_0 @ X24|(X24)=(esk2_1 @ X22)|~epred2_0 @ X22))&(epred1_0 @ (esk2_1 @ X22)|~epred2_0 @ X22))&(~epred1_0 @ X25|epred2_0 @ (esk1_0 @ X25)))&(((epred2_0 @ (esk5_1 @ X26)|epred1_0 @ (esk3_1 @ X26))&(~epred1_0 @ (X26 @ (esk5_1 @ X26))|epred1_0 @ (esk3_1 @ X26)))&((((epred2_0 @ (esk5_1 @ X26)|(epred2_0 @ (esk4_2 @ X26 @ X28)|(~epred2_0 @ X28|(esk3_1 @ X26)!=(X26 @ X28))))&(~epred1_0 @ (X26 @ (esk5_1 @ X26))|(epred2_0 @ (esk4_2 @ X26 @ X28)|(~epred2_0 @ X28|(esk3_1 @ X26)!=(X26 @ X28)))))&((epred2_0 @ (esk5_1 @ X26)|((esk3_1 @ X26)=(X26 @ (esk4_2 @ X26 @ X28))|(~epred2_0 @ X28|(esk3_1 @ X26)!=(X26 @ X28))))&(~epred1_0 @ (X26 @ (esk5_1 @ X26))|((esk3_1 @ X26)=(X26 @ (esk4_2 @ X26 @ X28))|(~epred2_0 @ X28|(esk3_1 @ X26)!=(X26 @ X28))))))&((epred2_0 @ (esk5_1 @ X26)|((esk4_2 @ X26 @ X28)!=(X28)|(~epred2_0 @ X28|(esk3_1 @ X26)!=(X26 @ X28))))&(~epred1_0 @ (X26 @ (esk5_1 @ X26))|((esk4_2 @ X26 @ X28)!=(X28)|(~epred2_0 @ X28|(esk3_1 @ X26)!=(X26 @ X28)))))))), inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_1])])])])])). 0.17/0.36 thf(c_0_3, negated_conjecture, ![X4:a]:((X4)=(esk1_0 @ (esk2_1 @ X4))|~epred2_0 @ X4), inference(split_conjunct,[status(thm)],[c_0_2])). 0.17/0.36 thf(c_0_4, negated_conjecture, ![X3:a > a, X4:a]:((esk3_1 @ X3)=(X3 @ (esk4_2 @ X3 @ X4))|~epred1_0 @ (X3 @ (esk5_1 @ X3))|~epred2_0 @ X4|(esk3_1 @ X3)!=(X3 @ X4)), inference(split_conjunct,[status(thm)],[c_0_2])). 0.17/0.36 thf(c_0_5, negated_conjecture, ![X3:a > a, X4:a]:(epred2_0 @ (esk4_2 @ X3 @ X4)|~epred1_0 @ (X3 @ (esk5_1 @ X3))|~epred2_0 @ X4|(esk3_1 @ X3)!=(X3 @ X4)), inference(split_conjunct,[status(thm)],[c_0_2])). 0.17/0.36 thf(c_0_6, negated_conjecture, ![X3:a > a, X4:a]:(epred2_0 @ (esk5_1 @ X3)|(esk3_1 @ X3)=(X3 @ (esk4_2 @ X3 @ X4))|~epred2_0 @ X4|(esk3_1 @ X3)!=(X3 @ X4)), inference(split_conjunct,[status(thm)],[c_0_2])). 0.17/0.36 thf(c_0_7, negated_conjecture, ![X3:a > a, X4:a]:(epred2_0 @ (esk5_1 @ X3)|epred2_0 @ (esk4_2 @ X3 @ X4)|~epred2_0 @ X4|(esk3_1 @ X3)!=(X3 @ X4)), inference(split_conjunct,[status(thm)],[c_0_2])). 0.17/0.36 thf(c_0_8, negated_conjecture, ![X3:a > a, X4:a]:(~epred1_0 @ (X3 @ (esk5_1 @ X3))|(esk4_2 @ X3 @ X4)!=(X4)|~epred2_0 @ X4|(esk3_1 @ X3)!=(X3 @ X4)), inference(split_conjunct,[status(thm)],[c_0_2])). 0.17/0.36 thf(c_0_9, negated_conjecture, ![X4:a]:(epred1_0 @ (esk2_1 @ X4)|~epred2_0 @ X4), inference(split_conjunct,[status(thm)],[c_0_2])). 0.17/0.36 thf(c_0_10, negated_conjecture, ![X3:a > a, X4:a]:(epred2_0 @ (esk5_1 @ X3)|(esk4_2 @ X3 @ X4)!=(X4)|~epred2_0 @ X4|(esk3_1 @ X3)!=(X3 @ X4)), inference(split_conjunct,[status(thm)],[c_0_2])). 0.17/0.36 thf(c_0_11, negated_conjecture, ![X4:a]:((esk4_2 @ esk2_1 @ X4)=(esk1_0 @ (esk3_1 @ esk2_1))|(esk3_1 @ esk2_1)!=(esk2_1 @ X4)|~epred1_0 @ (esk2_1 @ (esk5_1 @ esk2_1))|~epred2_0 @ X4), inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_3, c_0_4]), c_0_5])). 0.17/0.36 thf(c_0_12, negated_conjecture, ![X4:a]:((esk4_2 @ esk2_1 @ X4)=(esk1_0 @ (esk3_1 @ esk2_1))|epred2_0 @ (esk5_1 @ esk2_1)|(esk3_1 @ esk2_1)!=(esk2_1 @ X4)|~epred2_0 @ X4), inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_3, c_0_6]), c_0_7])). 0.17/0.36 thf(c_0_13, negated_conjecture, ![X4:a]:((esk3_1 @ esk2_1)!=(esk2_1 @ X4)|(esk4_2 @ esk2_1 @ X4)!=(X4)|~epred2_0 @ X4), inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_8, c_0_9]), c_0_10])). 0.17/0.36 thf(c_0_14, negated_conjecture, ![X4:a]:((esk4_2 @ esk2_1 @ X4)=(esk1_0 @ (esk3_1 @ esk2_1))|(esk3_1 @ esk2_1)!=(esk2_1 @ X4)|~epred2_0 @ X4), inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_11, c_0_9]), c_0_12])). 0.17/0.36 thf(c_0_15, negated_conjecture, ![X5:a, X4:a]:((X5)=(esk2_1 @ X4)|(X4)!=(esk1_0 @ X5)|~epred1_0 @ X5|~epred2_0 @ X4), inference(split_conjunct,[status(thm)],[c_0_2])). 0.17/0.36 thf(c_0_16, negated_conjecture, ![X4:a]:(epred2_0 @ (esk1_0 @ X4)|~epred1_0 @ X4), inference(split_conjunct,[status(thm)],[c_0_2])). 0.17/0.36 thf(c_0_17, negated_conjecture, ![X3:a > a]:(epred1_0 @ (esk3_1 @ X3)|~epred1_0 @ (X3 @ (esk5_1 @ X3))), inference(split_conjunct,[status(thm)],[c_0_2])). 0.17/0.36 thf(c_0_18, negated_conjecture, ![X3:a > a]:(epred2_0 @ (esk5_1 @ X3)|epred1_0 @ (esk3_1 @ X3)), inference(split_conjunct,[status(thm)],[c_0_2])). 0.17/0.36 thf(c_0_19, negated_conjecture, ((esk2_1 @ (esk1_0 @ (esk3_1 @ esk2_1)))!=(esk3_1 @ esk2_1)|~epred2_0 @ (esk1_0 @ (esk3_1 @ esk2_1))), inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_13, c_0_14])])). 0.17/0.36 thf(c_0_20, negated_conjecture, ![X4:a]:((esk2_1 @ (esk1_0 @ X4))=(X4)|~epred1_0 @ X4), inference(csr,[status(thm)],[inference(er,[status(thm)],[c_0_15]), c_0_16])). 0.17/0.36 thf(c_0_21, negated_conjecture, epred1_0 @ (esk3_1 @ esk2_1), inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_17, c_0_9]), c_0_18])). 0.17/0.36 thf(c_0_22, negated_conjecture, ~epred2_0 @ (esk1_0 @ (esk3_1 @ esk2_1)), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19, c_0_20]), c_0_21])])). 0.17/0.36 thf(c_0_23, negated_conjecture, ($false), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22, c_0_16]), c_0_21])]), ['proof']). 0.17/0.36 # SZS output end CNFRefutation 0.17/0.36 # Proof object total steps : 24 0.17/0.36 # Proof object clause steps : 21 0.17/0.36 # Proof object formula steps : 3 0.17/0.36 # Proof object conjectures : 24 0.17/0.36 # Proof object clause conjectures : 21 0.17/0.36 # Proof object formula conjectures : 3 0.17/0.36 # Proof object initial clauses used : 12 0.17/0.36 # Proof object initial formulas used : 1 0.17/0.36 # Proof object generating inferences : 8 0.17/0.36 # Proof object simplifying inferences : 12 0.17/0.36 # Training examples: 0 positive, 0 negative 0.17/0.36 # Parsed axioms : 2 0.17/0.36 # Removed by relevancy pruning/SinE : 0 0.17/0.36 # Initial clauses : 13 0.17/0.36 # Removed in clause preprocessing : 1 0.17/0.36 # Initial clauses in saturation : 12 0.17/0.36 # Processed clauses : 39 0.17/0.36 # ...of these trivial : 0 0.17/0.36 # ...subsumed : 6 0.17/0.36 # ...remaining for further processing : 33 0.17/0.36 # Other redundant clauses eliminated : 45 0.17/0.36 # Clauses deleted for lack of memory : 0 0.17/0.36 # Backward-subsumed : 4 0.17/0.36 # Backward-rewritten : 0 0.17/0.36 # Generated clauses : 263 0.17/0.36 # ...of the previous two non-trivial : 124 0.17/0.36 # Contextual simplify-reflections : 11 0.17/0.36 # Paramodulations : 80 0.17/0.36 # Factorizations : 0 0.17/0.36 # NegExts : 0 0.17/0.36 # Equation resolutions : 45 0.17/0.36 # Propositional unsat checks : 0 0.17/0.36 # Propositional check models : 0 0.17/0.36 # Propositional check unsatisfiable : 0 0.17/0.36 # Propositional clauses : 0 0.17/0.36 # Propositional clauses after purity: 0 0.17/0.36 # Propositional unsat core size : 0 0.17/0.36 # Propositional preprocessing time : 0.000 0.17/0.36 # Propositional encoding time : 0.000 0.17/0.36 # Propositional solver time : 0.000 0.17/0.36 # Success case prop preproc time : 0.000 0.17/0.36 # Success case prop encoding time : 0.000 0.17/0.36 # Success case prop solver time : 0.000 0.17/0.36 # Current number of processed clauses : 28 0.17/0.36 # Positive orientable unit clauses : 1 0.17/0.36 # Positive unorientable unit clauses: 0 0.17/0.36 # Negative unit clauses : 1 0.17/0.36 # Non-unit-clauses : 26 0.17/0.36 # Current number of unprocessed clauses: 97 0.17/0.36 # ...number of literals in the above : 754 0.17/0.36 # Current number of archived formulas : 0 0.17/0.36 # Current number of archived clauses : 4 0.17/0.36 # Clause-clause subsumption calls (NU) : 234 0.17/0.36 # Rec. Clause-clause subsumption calls : 47 0.17/0.36 # Non-unit clause-clause subsumptions : 21 0.17/0.36 # Unit Clause-clause subsumption calls : 5 0.17/0.36 # Rewrite failures with RHS unbound : 0 0.17/0.36 # BW rewrite match attempts : 0 0.17/0.36 # BW rewrite match successes : 0 0.17/0.36 # Condensation attempts : 0 0.17/0.36 # Condensation successes : 0 0.17/0.36 # Termbank termtop insertions : 6098 0.17/0.36 0.17/0.36 # ------------------------------------------------- 0.17/0.36 # User time : 0.030 s 0.17/0.36 # System time : 0.008 s 0.17/0.36 # Total time : 0.038 s 0.17/0.36 # Maximum resident set size: 1648 pages 0.17/0.36 EOF